A Modified Split Bregman Algorithm for Computing Microstructures Through Young Measures

نویسندگان

چکیده

The goal of this paper is to describe the oscillatory microstructure that can emerge from minimizing sequences for nonconvex energies. We consider integral functionals are defined on real valued (scalar) functions $u(x)$ which in gradient $\nabla u$ and possibly also $u$. To characterize microstructures these energies, we minimize associated relaxed energy using two novel approaches: i) a semi-analytical method based control systems theory, ii) numerical scheme combines convex splitting together with modified version split Bregman algorithm. These solutions then used gain information about original problem spatial distribution microstructure.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Image Deblurring using Split Bregman Iterative Algorithm

This paper presents a new variational algorithm for image deblurring by characterizing the properties of image local smoothness and nonlocal self-similarity simultaneously. Specifically, the local smoothness is measured by a Total Variation method, enforcing the local smoothness of images, while the nonlocal self similarity is measured by transforming the 3D array generated by grouping similar ...

متن کامل

A Modified Iterative Algorithm for Split Feasibility Problems of Right Bregman Strongly Quasi-Nonexpansive Mappings in Banach Spaces with Applications

In this paper, we present a new iterative scheme for finding a common element of the solution set F of the split feasibility problem and the fixed point set F(T) of a right Bregman strongly quasi-nonexpansive mapping T in p-uniformly convex Banach spaces which are also uniformly smooth. We prove strong convergence theorem of the sequences generated by our scheme under some appropriate condition...

متن کامل

Split Bregman Algorithm, Douglas-Rachford Splitting and Frame Shrinkage

We examine relations between popular variational methods in image processing and classical operator splitting methods in convex analysis. We focus on a gradient descent reprojection algorithm for image denoising and the recently proposed Split Bregman and alternating Split Bregman methods. By identifying the latter with the so-called DouglasRachford splitting algorithm we can guarantee its conv...

متن کامل

A Modified Algorithm for Solving the Split Feasibility Problem

In this paper a modified algorithm for solving the split feasibility problem (SFP) is presented. This algorithm uses the generalized Armijo line search in computing predictor step size and gives a correction step rule in the iterative process, which makes an accelerated convergence to the solution of SFP. Meanwhile, it needs not to compute the matrix inverses and the large eigenvalue of the mat...

متن کامل

A SIMPLE ALGORITHM FOR COMPUTING TOPOLOGICAL INDICES OF DENDRIMERS

Dendritic macromolecules’ have attracted much attention as organic examples of well-defined nanostructures. These molecules are ideal model systems for studying how physical properties depend on molecular size and architecture. In this paper using a simple result, some GAP programs are prepared to compute Wiener and hyper Wiener indices of dendrimers.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Multiscale Modeling & Simulation

سال: 2021

ISSN: ['1540-3459', '1540-3467']

DOI: https://doi.org/10.1137/19m1306907